High-Speed Decoding of the Binary Golay Code

High-Speed Decoding of the Binary Golay Code

Recently, some table-lookup decoding algorithms (TLDAs) have been used to correct the binary Golay code. This paper proposes an efficient high-speed TLDA called message-syndrome decoding algorithm (MSDA) by using the message syndrome to correct the binary systematic Golay code. The proposed MSDA is based on the novel message-syndrome lookup table (MSLT). The MSLT merely consists of 12 candidate...

On high-speed decoding of the (23, 12, 7) Golay code

Decoding the Golay code with Venn diagrams

A decoding algorithm based on Venn diagrams to decode the [23, 12, 71 Golay code is presented. The decoding algorithm is based on the “design” properties of the parity sets of the code. As for other decoding algorithms for the Golay code, decoding can be easily done by hand.

Symbol-by-symbol APP decoding of the Golay code and iterative decoding of concatenated Golay codes

An efficient coset based symbol-by-symbol soft-in/soft-out APP decoding algorithm is presented for the Golay code. Its application in the iterative decoding of concatenated Golay codes is examined.

Constructing the Extended Binary Golay Code

Coding theory is the subject which is concerned with how information can be sent over a noisy channel. A code then is a collection of codewords which are strings of a fixed number of letters from an alphabet. Some of these strings are codewords others are not. When a codeword is sent over a channel there is a probability less than /2 that each letter in the codeword will be changed, thus introd...